Scalarization and well-posedness for set optimization using coradiant sets

Well-posedness and scalarization in vector optimization

In this paper we study several existing notions of well-posedness for vector optimization problems. We distinguish them into two classes and we establish the hierarchical structure of their relationships. Moreover, we relate vector well-posedness and well-posedness of an appropriate scalarization. This approach allows us to show that, under some compactness assumption, quasiconvex problems are ...

Well-posedness and convexity in vector optimization

On well-posedness in vector optimization

Generic Well-posedness for Perturbed Optimization Problems in Banach Spaces

Let X be a Banach space and Z a relatively weakly compact subset of X. Let J : Z → R be a upper semicontinuous function bounded from above and p ≥ 1. This paper is concerned with the perturbed optimization problem of finding z0 ∈ Z such that ‖x− z0‖ + J(z0) = supz∈Z{‖x− z‖p + J(z)}, which is denoted by maxJ(x, Z). We prove in the present paper that if X is Kadec w.r.t. Z, then the set of all x ...

Set Approach for Set Optimization with Variable Ordering Structures Part II: Scalarization Approaches

This paper aims at combining variable ordering structures with set relations in set optimization, which have been defined using the constant ordering cone before. Since the purpose is to connect these two important approaches in set optimization, we do not restrict our considerations to one certain relation. Conversely, we provide the reader with many new variable set relations generalizing the...